A permutation code preserving a double Eulerian bistatistic

نویسندگان

  • Jean-Luc Baril
  • Vincent Vajnovszki
چکیده

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture has been proved by Aas in 2014, and the generating function of the corresponding bistatistics is the double Eulerian polynomial. Among the techniques used by Aas are the Möbius inversion formula and isomorphism of labeled rooted trees. In this paper we define a permutation code (that is, a bijection between permutations and subexcedant sequences) and show the more general result that two 5-tuples of set-valued statistics on the set of permutations and on the set of subexcedant sequences, respectively, are equidistributed. In particular, these results give a bijective proof of Visontai’s conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern and position based permutation statistics

Falling permutation patterns of length two where we allow to mark adjacency both in position and value give rise to three statistics, namely the adjacency (πi − πi+1 = 1), the descent and the inversion. The two former are equidistributed with the position based statistics fixed points and excedances, and the latter is Mahonian and thus equidistributed with many statistics. We prove that the bis...

متن کامل

On Some Properties of Permutation Tableaux

We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the open problems of Steingŕımsson and Williams [8], in particular, on the distribution of the bistatistic of numbers of rows and essential ones in permutation tableaux. We also consider and enumerate sets of permutation tableaux related to some pattern restrictions on permu...

متن کامل

The remoteness of the permutation code of the group $U_{6n}$

Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness.  We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$.  Moreover, ...

متن کامل

Efficient generating algorithm for permutations with a fixed number of excedances

In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...

متن کامل

A simple recurrence for covers of the sphere with branch points of arbitrary ramification

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800’s. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity. Goulden and Jackson have given a proof for the number of minimal, transitive facto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 224  شماره 

صفحات  -

تاریخ انتشار 2017